Parallel computation of real solving bivariate polynomial systems by zero-matching method
نویسندگان
چکیده
منابع مشابه
Parallel computation of real solving bivariate polynomial systems by zero-matching method
We present a new algorithm for solving the real roots of a bivariate polynomial system R 1⁄4 ff ðx; yÞ; gðx; yÞg with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for the bivariate polynomial system when the system is non-zero. Moreover, the multiplicities of the roots of R 1⁄4 0 can be obtained by the associated quotient ring technique and ...
متن کاملReal Solving of Bivariate Polynomial Systems
We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means isolating all common real solutions in rational rectangles and calculating the respective multiplicities. Second, the computation of the sign of bivariate polynomials evaluated at two algebraic numbers of arbitrary degree. Our ...
متن کاملOn the Complexity of Real Solving of Bivariate Polynomial Systems
In this paper we present algorithmic and complexity results for polynomial sign evaluation over two real algebraic numbers, and for real solving of bivariate polynomial systems. Our main tool is signed polynomial remainder sequences; we exploit recent advances in univariate root isolation as well as multipoint evaluation techniques.
متن کاملSolving Real Polynomial Systems with Real Homotopies
When a real homotopy is used for solving a polynomial system with real coefficients, bifurcation of some of the homotopy paths at singular points is inevitable. The main result of this paper shows that, generically, the solution set of a real homotopy contains no singular point other than a finite number of quadratic turning points. At a quadratic turning point, the bifurcation phenomenon is qu...
متن کاملSolving Polynomial Systems Symbolically and in Parallel
We discuss the parallelization of algorithms for solving polynomial systems symbolically. We introduce a component-level parallelization: our objective is to develop a parallel solver for which the number of processors in use depends on the intrinsic complexity of the input system, that is on geometry of its solution set. This approach creates new opportunities for parallel execution of polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2013
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.01.039